Testing Deep Learning (DL) based systems inherently requires large and representative test sets to evaluate whether DL systems generalise beyond their training datasets. Diverse Test Input Generators (TIGs) have been proposed to produce artificial inputs that expose issues of the DL systems by triggering misbehaviours. Unfortunately, such generated inputs may be invalid, i.e., not recognisable as part of the input domain, thus providing an unreliable quality assessment. Automated validators can ease the burden of manually checking the validity of inputs for human testers, although input validity is a concept difficult to formalise and, thus, automate. In this paper, we investigate to what extent TIGs can generate valid inputs, according to both automated and human validators. We conduct a large empirical study, involving 2 different automated validators, 220 human assessors, 5 different TIGs and 3 classification tasks. Our results show that 84% artificially generated inputs are valid, according to automated validators, but their expected label is not always preserved. Automated validators reach a good consensus with humans (78% accuracy), but still have limitations when dealing with feature-rich datasets.
translated by 谷歌翻译
The reconstruction of images from their corresponding noisy Radon transform is a typical example of an ill-posed linear inverse problem as arising in the application of computerized tomography (CT). As the (na\"{\i}ve) solution does not depend on the measured data continuously, regularization is needed to re-establish a continuous dependence. In this work, we investigate simple, but yet still provably convergent approaches to learning linear regularization methods from data. More specifically, we analyze two approaches: One generic linear regularization that learns how to manipulate the singular values of the linear operator in an extension of [1], and one tailored approach in the Fourier domain that is specific to CT-reconstruction. We prove that such approaches become convergent regularization methods as well as the fact that the reconstructions they provide are typically much smoother than the training data they were trained on. Finally, we compare the spectral as well as the Fourier-based approaches for CT-reconstruction numerically, discuss their advantages and disadvantages and investigate the effect of discretization errors at different resolutions.
translated by 谷歌翻译
Continual Learning, also known as Lifelong or Incremental Learning, has recently gained renewed interest among the Artificial Intelligence research community. Recent research efforts have quickly led to the design of novel algorithms able to reduce the impact of the catastrophic forgetting phenomenon in deep neural networks. Due to this surge of interest in the field, many competitions have been held in recent years, as they are an excellent opportunity to stimulate research in promising directions. This paper summarizes the ideas, design choices, rules, and results of the challenge held at the 3rd Continual Learning in Computer Vision (CLVision) Workshop at CVPR 2022. The focus of this competition is the complex continual object detection task, which is still underexplored in literature compared to classification tasks. The challenge is based on the challenge version of the novel EgoObjects dataset, a large-scale egocentric object dataset explicitly designed to benchmark continual learning algorithms for egocentric category-/instance-level object understanding, which covers more than 1k unique main objects and 250+ categories in around 100k video frames.
translated by 谷歌翻译
This work studies networked agents cooperating to track a dynamical state of nature under partial information. The proposed algorithm is a distributed Bayesian filtering algorithm for finite-state hidden Markov models (HMMs). It can be used for sequential state estimation tasks, as well as for modeling opinion formation over social networks under dynamic environments. We show that the disagreement with the optimal centralized solution is asymptotically bounded for the class of geometrically ergodic state transition models, which includes rapidly changing models. We also derive recursions for calculating the probability of error and establish convergence under Gaussian observation models. Simulations are provided to illustrate the theory and to compare against alternative approaches.
translated by 谷歌翻译
这篇简短的论文提出了对当前在社交媒体上使用的美容过滤器技术中种族偏见的初步研究。获得的结果是对计算机视觉研究人员的行动呼吁:这种偏见的风险被复制和夸大了,因此,他们值得从社区那里得到更多关注。
translated by 谷歌翻译
我们介绍了de bruijn图神经网络(DBGNNS),这是一种新颖的时间感知图神经网络体系结构,用于动态图上的时间分辨数据。我们的方法解释了动态图的因果拓扑中展开的时间流行模式,该模式由因果步行确定,即节点可以随着时间的时间影响彼此的链接序列。我们的架构建立在多层de bruijn图的多层上,这是一个迭代的线图结构,其中d de bruijn图中的节点k表示长度k-1的步行,而边缘则表示长度k的步行。我们开发了一个图形神经网络体系结构,该架构利用de bruijn图来实现遵循非马克维亚动力学的消息传递方案,该方案使我们能够在动态图的因果拓扑中学习模式。解决de bruijn图形不同订单k的问题可用于建模相同的数据集,我们进一步应用统计模型选择以确定用于消息传递的最佳图形拓扑。合成和经验数据集的评估表明,DBGNN可以利用动态图中的时间模式,从而大大改善了监督节点分类任务中的性能。
translated by 谷歌翻译
在本文中,我们考虑了分散的优化问题,在这些问题中,代理具有个人成本函数,以最大程度地减少受到子空间约束的约束,这些子空间约束需要整个网络的最小化器才能位于低维子空间中。这种约束的公式包括共识或单任务优化作为特殊情况,并允许更一般的任务相关性模型,例如多任务平滑度和耦合优化。为了应对沟通限制,我们提出并研究一种自适应分散策略,在该策略中,代理人在与邻居进行交流之前,使用差异随机量化器来压缩其估计。分析表明,在量化噪声的某些一般条件下,对于足够小的步长$ \ mu $,该策略在均方误差和平均比特率方面都是稳定的:通过减少$ \ mu $,可以将估计错误保持较小(按$ \ mu $)保持较小,而不会无限地增加比特率为$ \ mu \ rightarrow 0 $。模拟说明了理论发现和提议方法的有效性,表明可以实现分散学习,但仅需少量。
translated by 谷歌翻译
我们提出了一种系统解决方案,以实现使用热图像和惯性测量的飞行机器人团队的数据效率,分散的状态估计。每个机器人可以独立飞行,并在可能的情况下交换数据以完善其状态估计。我们的系统前端应用在线光度校准以完善热图像,从而增强功能跟踪并放置识别。我们的系统后端使用协方差融合策略来忽略代理之间的互相关,以降低内存使用和计算成本。通信管道使用本地汇总的描述符(VLAD)的向量来构建需要较低带宽使用情况的请求响应策略。我们在合成数据和现实世界数据上测试我们的协作方法。我们的结果表明,相对于个人代理方法,该提出的方法最多可提高46%的轨迹估计,同时减少多达89%的通信交换。数据集和代码将发布给公众,扩展了已经发布的JPL XVIO库。
translated by 谷歌翻译
在自拍照上的增强现实或AR过滤器在社交媒体平台上已经非常受欢迎,用于各种应用程序,包括营销,娱乐和美学。鉴于AR面部过滤器的广泛采用以及面孔在我们的社会结构和关系中的重要性,科学界从心理,艺术和社会学的角度分析此类过滤器的影响增加了。但是,该领域的定量分析很少,这主要是由于缺乏具有应用AR过滤器的面部图像的公开数据集。大多数社交媒体平台的专有性,紧密的性质不允许用户,科学家和从业人员访问代码和可用AR面孔过滤器的详细信息。从这些平台上刮擦面孔以收集数据在道德上是不可接受的,因此应在研究中避免。在本文中,我们介绍了OpenFilter,这是一个灵活的框架,可在社交媒体平台上使用AR过滤器,可在现有的大量人体面孔上使用。此外,我们共享FairBeauty和B-LFW,这是公开可用的Fairface和LFW数据集的两个美化版本,我们概述了这些美化数据集的分析得出的见解。
translated by 谷歌翻译
可以使用几种技术来解决沿规定路径的最佳运动计划,但是大多数技术没有考虑到与环境接触时最终效用器所施加的扳手。当无法获得环境的动态模型时,就不存在合并方法来考虑相互作用的效果。无论要优化的特定性能指数如何,本文都提出了一种策略,将外部扳手包括在最佳计划算法中,考虑到任务规格。此过程是针对最小时间轨迹实例化的,并在接纳控制下执行交互任务的真实机器人进行了验证。结果证明,最终效应器扳手的包含会影响计划的轨迹,实际上改变了操纵器的动态能力。
translated by 谷歌翻译